Covering Sets for Limited-Magnitude Errors

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Covering Sets for Limited-Magnitude Errors

The concept of a covering set for the limited-magnitude error channel is introduced. A number of covering-set constructions, as well as some bounds, are given. In particular, optimal constructions are given for some cases involving small-magnitude errors.

متن کامل

Linear covering codes and error-correcting codes for limited-magnitude errors

The concepts of a linear covering code and a covering set for the limitedmagnitude-error channel are introduced. A number of covering-set constructions, as well as some bounds, are given. In particular, optimal constructions are given for some cases involving small-magnitude errors. A problem of Stein is partially solved for these cases. Optimal packing sets and the corresponding error-correcti...

متن کامل

Erratum to: Linear covering codes and error-correcting codes for limited-magnitude errors

The expression for ω 2,2,r (2t) in Theorem 9 is misprinted in the original publication of this article. It should have been the same as for ω 2,1,r (2t) in Theorem 11. The correct expression in Theorem 9 will be Theorem 9 For q = 2t where t is odd, we have ω 2,2,r (2t) = 1 2 (2 r − 1)(t r + 1) .

متن کامل

Some codes correcting single symmetric errors of limited magnitude

An error model with symmetric errors of limited magnitude is considered. Limited magnitude means that the size of any error is limited by a number smaller (usually much smaller) than the alphabet size. Several constructions of codes correcting single error are given. In some cases, the codes are perfect or quasi-perfect.

متن کامل

On the Existence of Perfect Codes for Asymmetric Limited-Magnitude Errors

Block codes, which correct asymmetric errors with limited-magnitude, are studied. These codes have been applied recently for error correction in flash memories. The codes will be represented by lattices and the constructions will be based on a generalization of Sidon sequences. In particular we will consider perfect codes for these type of errors.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2014

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2014.2338078